El Sistema electoral a Austràlia : convivència en la complexitat democràtica

L'objectiu d'aquestes pàgines és descriure el desenvolupament del sistema electoral a Austràlia des de la perspectiva que comporta tant la seva complexitat com flexibilitat. Una complexitat a què s'ha acostumat el ciutadà australià fruit de la naturalesa federal del país. En comptes que les modificacions en les regles del joc democràtic facin perillar la credibilitat del poder polític, Austràlia sempre ha conservat una ferma evolució política a partir dels eixos de buscar la millor representació ciutadana. Aquesta diversitat i sofisticació constant no han portat a la ciutadania a una desinhibició de les regles democràtiques, sinó que s'ha combinat amb una participació electoral obligada dels ciutadans que els implica directament amb el seu sistema polític

Mobility of a class of perforated polyhedra

A class of over-braced but typically flexible body-hinge frameworks is described. They are based on polyhedra with rigid faces where an independent subset of faces has been replaced by a set of holes. The contact polyhedron C describing the bodies (vertices of C) and their connecting joints (edges of C) is derived by subdivision of the edges of an underlying cubic polyhedron. Symmetry calculations detect flexibility not revealed by counting alone. A generic symmetry-extended version of the Grübler-Kutzbach mobility counting rule accounts for the net mobilities of infinite families of this type (based on subdivisions of prisms, wedges, barrels, and some general inflations of a parent polyhedron). The prisms with all faces even and all barrels are found to generate flexible perforated polyhedra under the subdivision construction. The investigation was inspired by a question raised by Walter Whiteley about a perforated polyhedron with a unique mechanism reducing octahedral to tetrahedral symmetry. It turns out that the perforated polyhedron with highest (OhOh) point-group symmetry based on subdivision of the cube is mechanically equivalent to the Hoberman Switch-Pitch toy. Both objects exhibit an exactly similar mechanism that preserves TdTd subgroup symmetry over a finite range; this mechanism survives in two variants suggested by Bob Connelly and Barbara Heys that have the same contact graph, but lower initial maximum symmetry.Supported by EPSRC First Grant EP/M013642/1.This is the final version of the article. It first appeared from Elsevier via https://doi.org/10.1016/j.ijsolstr.2016.02.00

Symmetry perspectives on some auxetic body-bar frameworks

Scalar mobility counting rules and their symmetry extensions are reviewed for finite frameworks and also for infinite periodic frameworks of the bar-and-joint, body-joint and body-bar types. A recently published symmetry criterion for the existence of equiauxetic character of an infinite framework is applied to two long known but apparently little studied hinged-hexagon frameworks, and is shown to detect auxetic behaviour in both. In contrast, for double-link frameworks based on triangular and square tessellations, other affine deformations can mix with the isotropic expansion mode.P.W. Fowler acknowledges support from the Royal Society/Leverhulme Trust in the form of a Senior Research Fellowship for 2013. T. Tarnai is grateful for financial support under OKTA grant K81146.This is the final published version distributed under a Creative Commons Attribution License, which can also be found on the publisher's website at: http://www.mdpi.com/2073-8994/6/2/36

Equiauxetic Hinged Archimedean Tilings

There is increasing interest in two-dimensional and quasi-two-dimensional materials and metamaterials for applications in chemistry, physics and engineering. Some of these applications are driven by the possible auxetic properties of such materials. Auxetic frameworks expand along one direction when subjected to a perpendicular stretching force. An equiauxetic framework has a unique mechanism of expansion (an equiauxetic mode) where the symmetry forces a Poisson’s ratio of −1. Hinged tilings offer opportunities for the design of auxetic and equiauxetic frameworks in 2D, and generic auxetic behaviour can often be detected using a symmetry extension of the scalar counting rule for mobility of periodic body-bar systems. Hinged frameworks based on Archimedean tilings of the plane are considered here. It is known that the regular hexagonal tiling, {63}, leads to an equiauxetic framework for both single-link and double-link connections between the tiles. For single-link connections, three Archimedean tilings considered as hinged body-bar frameworks are found here to be equiauxetic: these are {3.122}, {4.6.12}, and {4.82}. For double-link connections, three Archimedean tilings considered as hinged body-bar frameworks are found to be equiauxetic: these are {34.6}, {32.4.3.4}, and {3.6.3.6}.NKFI

Applying Grover's algorithm to AES: quantum resource estimates

We present quantum circuits to implement an exhaustive key search for the Advanced Encryption Standard (AES) and analyze the quantum resources required to carry out such an attack. We consider the overall circuit size, the number of qubits, and the circuit depth as measures for the cost of the presented quantum algorithms. Throughout, we focus on Clifford$+T$ gates as the underlying fault-tolerant logical quantum gate set. In particular, for all three variants of AES (key size 128, 192, and 256 bit) that are standardized in FIPS-PUB 197, we establish precise bounds for the number of qubits and the number of elementary logical quantum gates that are needed to implement Grover's quantum algorithm to extract the key from a small number of AES plaintext-ciphertext pairs.Comment: 13 pages, 3 figures, 5 tables; to appear in: Proceedings of the 7th International Conference on Post-Quantum Cryptography (PQCrypto 2016

Quantum resource estimates for computing elliptic curve discrete logarithms

We give precise quantum resource estimates for Shor's algorithm to compute discrete logarithms on elliptic curves over prime fields. The estimates are derived from a simulation of a Toffoli gate network for controlled elliptic curve point addition, implemented within the framework of the quantum computing software tool suite LIQ$Ui|\rangle$. We determine circuit implementations for reversible modular arithmetic, including modular addition, multiplication and inversion, as well as reversible elliptic curve point addition. We conclude that elliptic curve discrete logarithms on an elliptic curve defined over an $n$-bit prime field can be computed on a quantum computer with at most $9n + 2\lceil\log_2(n)\rceil+10$ qubits using a quantum circuit of at most $448 n^3 \log_2(n) + 4090 n^3$ Toffoli gates. We are able to classically simulate the Toffoli networks corresponding to the controlled elliptic curve point addition as the core piece of Shor's algorithm for the NIST standard curves P-192, P-224, P-256, P-384 and P-521. Our approach allows gate-level comparisons to recent resource estimates for Shor's factoring algorithm. The results also support estimates given earlier by Proos and Zalka and indicate that, for current parameters at comparable classical security levels, the number of qubits required to tackle elliptic curves is less than for attacking RSA, suggesting that indeed ECC is an easier target than RSA.Comment: 24 pages, 2 tables, 11 figures. v2: typos fixed and reference added. ASIACRYPT 201

Improved quantum circuits for elliptic curve discrete logarithms

We present improved quantum circuits for elliptic curve scalar multiplication, the most costly component in Shor's algorithm to compute discrete logarithms in elliptic curve groups. We optimize low-level components such as reversible integer and modular arithmetic through windowing techniques and more adaptive placement of uncomputing steps, and improve over previous quantum circuits for modular inversion by reformulating the binary Euclidean algorithm. Overall, we obtain an affine Weierstrass point addition circuit that has lower depth and uses fewer $T$ gates than previous circuits. While previous work mostly focuses on minimizing the total number of qubits, we present various trade-offs between different cost metrics including the number of qubits, circuit depth and $T$-gate count. Finally, we provide a full implementation of point addition in the Q# quantum programming language that allows unit tests and automatic quantum resource estimation for all components.Comment: 22 pages, to appear in: Int'l Conf. on Post-Quantum Cryptography (PQCrypto 2020

A crowd of BashTheBug volunteers reproducibly and accurately measure the minimum inhibitory concentrations of 13 antitubercular drugs from photographs of 96-well broth microdilution plates

Tuberculosis is a respiratory disease that is treatable with antibiotics. An increasing prevalence of resistance means that to ensure a good treatment outcome it is desirable to test the susceptibility of each infection to different antibiotics. Conventionally, this is done by culturing a clinical sample and then exposing aliquots to a panel of antibiotics, each being present at a pre-determined concentration, thereby determining if the sample isresistant or susceptible to each sample. The minimum inhibitory concentration (MIC) of a drug is the lowestconcentration that inhibits growth and is a more useful quantity but requires each sample to be tested at a range ofconcentrations for each drug. Using 96-well broth micro dilution plates with each well containing a lyophilised pre-determined amount of an antibiotic is a convenient and cost-effective way to measure the MICs of several drugs at once for a clinical sample. Although accurate, this is still an expensive and slow process that requires highly-skilled and experienced laboratory scientists. Here we show that, through the BashTheBug project hosted on the Zooniverse citizen science platform, a crowd of volunteers can reproducibly and accurately determine the MICs for 13 drugs and that simply taking the median or mode of 11-17 independent classifications is sufficient. There is therefore a potential role for crowds to support (but not supplant) the role of experts in antibiotic susceptibility testing

Structural and Thermodynamic Characterization of the Gating Pathway in a K+ Channel

YesConference abstrac

Using Long-Term Volunteer Records to Examine Dormouse (Muscardinusavellanarius) Nestbox Selection.

Within ecology, there are unanswered questions about species-habitat interactions, which could potentially be resolved by a pragmatic analysis of a long-term volunteer-collected dataset. Here, we analysed 18 years of volunteer-collected data from a UK dormouse nestbox monitoring programme to determine the influence of habitat variables on nestbox choice by common dormice (Muscardinusavellanarius). We measured a range of habitat variables in a coppiced woodland in Gloucestershire, UK, and analysed these in relation to dormouse nestbox occupancy records (by dormice, other small mammals, and birds) collected by volunteers. While some characteristics of the woodland had changed over 18 years, simple transformation of the data and interpretation of the results indicated that the dataset was informative. Using stepwise regressions, multiple environmental and ecological factors were found to determine nestbox selection. Distance from the edge of the wood was the most influential (this did not change over 18 years), with boxes in the woodland interior being selected preferentially. There was a significant negative relationship with the presence of ferns (indicative of damp shady conditions). The presence of oak (a long-lived species), and the clumped structural complexity of the canopy were also important factors in the final model. There was no evidence of competition between dormice and birds or other mammals. The results provide greater understanding of artificial dormouse nest-site requirements and indicate that, in terms of habitat selection, long-term volunteer-collected datasets contribute usefully to understanding the requirements of species with an important conservation status